Algebraic cryptography: new constructions and their security against provable break
نویسندگان
چکیده
منابع مشابه
Algebraic cryptography: new constructions and their security against provable break?
Very few known cryptographic primitives are based on noncommutative algebra. Each new scheme is of substantial interest, because noncommutative constructions are secure agains many standard cryptographic attacks. On the other hand, cryptography does not provide security proofs that would allow to base the security of a cryptographic primitive on structural complexity assumptions. Thus, it is im...
متن کاملSignatures in hierarchical certificateless cryptography: Efficient constructions and provable security
Recent years, lots of efforts have been devoted to construct secure schemes in certificateless cryptography which eliminates the key escrow problem in identity-based cryptography. However, most of them are designed in traditional certificateless cryptography which suffers from the single-point problem. Hierarchical cryptography exploits a practical security model to mirror the organizational hi...
متن کاملProvable Security in Cryptography
These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key Schemes” [24], on Victor Shoup’s tutorial on game playing techniques [30], on Coron’s Crypto’00 paper on the exact security of the Full Doma...
متن کاملProvable Security for Physical Cryptography
The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that schemes are secure in this model. An exception is the design of countermeasures against cryptographic sidechannel attacks, which even today is mostly based on heuristic arguments, which only try to prevent particular attacks. It was long believed that side-channels are ...
متن کاملInvariant-based Cryptosystems and Their Security Against Provable Worst-Case Break?
Cryptography based on noncommutative algebra still suffers from lack of schemes and lack of interest. In this work, we show new constructions of cryptosystems based on group invariants and suggest methods to make such cryptosystems secure in practice. Cryptographers still cannot prove security in its cryptographic sense or even reduce it to some statement about regular complexity classes. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: St. Petersburg Mathematical Journal
سال: 2009
ISSN: 1061-0022
DOI: 10.1090/s1061-0022-09-01079-6